Bounds on Mixed Binary/Ternary Codes
نویسندگان
چکیده
Upper and lower bounds are presented for the maximal possible size of mixed binary/ternary error-correcting codes. A table up to length 13 is included. The upper bounds are obtained by applying the linear programming bound to the product of two association schemes. The lower bounds arise from a number of different constructions.
منابع مشابه
Some new lower bounds for ternary covering codes
In [5], we studied binary codes with covering radius one via their characteristic functions. This gave us an easy way of obtaining congruence properties and of deriving interesting linear inequalities. In this paper we extend this approach to ternary covering codes. We improve on lower bounds for ternary 1-covering codes, the so-called football pool problem, when 3 does not divide n − 1. We als...
متن کاملOn the Generating Function and its Application to Ternary Line Codes
One of the major problems researchers face is how to verify experimental or simulation results of any class of codes. Usually this can be done by deriving bounds to test the performance of codes. As they are used in binary codes and especially in linear convolutional codes, where the sum of any two codewords is another codeword and the all-zeros sequence is a codeword, the major step to derive ...
متن کاملNew Bounds for Binary and Ternary Overloaded CDMA
In this paper, we study binary and ternary matrices that are used for CDMA applications that are injective on binary or ternary user vectors. In other words, in the absence of additive noise, the interference of overloaded CDMA can be removed completely. Some new algorithms are proposed for constructing such matrices. Also, using an information theoretic approach, we conjecture the extent to wh...
متن کاملOn extremal self-dual ternary codes of length 48
The notion of an extremal self-dual code has been introduced in 1 . As Gleason 2 remarks onemay use invariance properties of the weight enumerator of a self-dual code to deduce upper bounds on the minimum distance. Extremal codes are self-dual codes that achieve these bounds. The most wanted extremal code is a binary self-dual doubly even code of length 72 and minimum distance 16. One frequentl...
متن کاملUpper bounds for ternary constant weight codes from semidefinite programming and representation theory
In this thesis we use a semidefinite programming approach to find explicit upper bounds on the size of ternary constant weight codes with prescribed minimum distance d. By constructing a graph Γ = (X,E), on the set, X, of all possible ternary words of weight w letting {x, y} ∈ E ⇔ 0 < dH(x, y) < d, we can view this problem as a special case of the stable set problem. Using symmetry, the constra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 44 شماره
صفحات -
تاریخ انتشار 1998